package binarytree;

public class BuildTree {
    public class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int x) {
            val = x;
        }
    }

    public TreeNode buildTree(int[] preorder, int[] inorder) {
        int len=preorder.length;
        int ps=0,is=0,pe=len,ie=len;
        if (ps>pe || is>ie) return null;
        TreeNode root=new TreeNode(preorder[ps]);


        return null;
    }
}
